Two Game-Set Inequalities
نویسنده
چکیده
Two players compete in a contest where the first player to win a specified number of points wins the game, and the first player to win a specified number of games wins the set. This paper proves two generalized inequalities, each independent of the probability of winning a point, concerning the better player’s chances of winning. Counterexamples are given for two additional conjectured inequalities. A sequence of integers which plays a significant role in this paper can be found in A033820 of the On-line Encyclopedia of Integer Sequences.
منابع مشابه
Equivalence between Bell inequalities and quantum Minority game
We show that, for a continuous set of entangled four-partite states, the task of maximizing the payoff in the symmetric-strategy four-player quantum Minority game is equivalent to maximizing the violation of a four-particle Bell inequality with each observer choosing the same set of two dichotomic observables. We conclude the existence of direct correspondences between (i) the payoff rule and B...
متن کاملSolutions of variational inequalities on fixed points of nonexpansive mappings
n this paper , we propose a generalized iterative method forfinding a common element of the set of fixed points of a singlenonexpannsive mapping and the set of solutions of two variationalinequalities with inverse strongly monotone mappings and strictlypseudo-contractive of Browder-Petryshyn type mapping. Our resultsimprove and extend the results announced by many others.
متن کاملVehicle Routing Problem in Competitive Environment: Two-Person Nonzero Sum Game Approach
Vehicle routing problem is one of the most important issues in transportation. Among VRP problems, the competitive VRP is more important because there is a tough competition between distributors and retailers. In this study we introduced new method for VRP in competitive environment. In these methods Two-Person Nonzero Sum games are defined to choose equilibrium solution. Therefore, revenue giv...
متن کاملSOLUTION-SET INVARIANT MATRICES AND VECTORS IN FUZZY RELATION INEQUALITIES BASED ON MAX-AGGREGATION FUNCTION COMPOSITION
Fuzzy relation inequalities based on max-F composition are discussed, where F is a binary aggregation on [0,1]. For a fixed fuzzy relation inequalities system $ A circ^{F}textbf{x}leqtextbf{b}$, we characterize all matrices $ A^{'} $ For which the solution set of the system $ A^{' } circ^{F}textbf{x}leqtextbf{b}$ is the same as the original solution set. Similarly, for a fixed matrix $ A $, the...
متن کاملConstructing quantum games from a system of Bell’s inequalities
We report constructing quantum games directly from a system of Bell’s inequalities using Arthur Fine’s analysis published in early 1980s. This analysis showed that such a system of inequalities forms a set of both necessary and sufficient conditions required to find a joint distribution function compatible with a given set of joint probabilities, in terms of which the system of Bell’s inequalit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004